Layout Optimization of Wireless Access Point Placement using Greedy and Simulated Annealing Algorithms
نویسندگان
چکیده
The development of Wi-Fi network is not only about the installment of access point infrastructure, but also related to various factors such as signal strength of the access point, design and infrastructure of the room, distribution of groups of access point users, radio wave interferences, and signal obstacles. Therefore in a Wi-Fi network, the placement of access point has a significant impact on receiver’s coverage area. In this paper, a signal strength of the receiver’s access point was measured using InSSIDer application and RSSI (Receive Signal Strength Indicator) values on Line of Sight (LoS) propagation and Non Line of Sight (NLoS) were obtained. A data obtained from the measurement has been modeled into a simulation of determining a position of the access point using Simulated Annealing and Greedy Algorithms. Testing result determined optimal coordinates for access point positions for both algorithms and performance of both algorithms has been compared to previous design before optimization conducted.
منابع مشابه
A Routing-Aware Simulated Annealing-based Placement Method in Wireless Network on Chips
Wireless network on chip (WiNoC) is one of the promising on-chip interconnection networks for on-chip system architectures. In addition to wired links, these architectures also use wireless links. Using these wireless links makes packets reach destination nodes faster and with less power consumption. These wireless links are provided by wireless interfaces in wireless routers. The WiNoC archite...
متن کاملFinding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کاملAn Integrated Approach to Optimal Three
This paper describes the combination of previously-developed component placement and routing algorithms into an integrated computational approach to product layout optimization. Previ ous work introduced simulated annealing-based algorithms for optimal component packing (Szykman and Cagan, 1995), con strained layout (Szykman and Cagan, 1997), and routing (Szyk man and Cagan, 1996). These proble...
متن کاملPMU Placement Methods in Power Systems based on Evolutionary Algorithms and GPS Receiver
In this paper, optimal placement of Phasor Measurement Unit (PMU) using Global Positioning System (GPS) is discussed. Ant Colony Optimization (ACO), Simulated Annealing (SA), Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) are used for this problem. Pheromone evaporation coefficient and the probability of moving from state x to state y by ant are introduced into the ACO. The modifi...
متن کاملA PARALLEL HIERARCHICAL ALGORITHM FOR MODULE PLACEMENT BASED ON SPARSE LINEAR EQUATIONS - Circuits and Systems, 1996., ISCAS '96, 'Connecting the World'., 1996 IEEE International Symposium
We present a fast and effective module placement algorithm which is based on the PROUD algorithm. The PROUD algorithm uses a hierarchical decomposition technique and the solution of sparse linear systems of equations based on a resistive network analogy. It has been shown that the PROUD algorithm is suitable for solving the placement problem for very large circuits, and obtains placement qualit...
متن کامل